منابع مشابه
Parsing Schemata and Correctness of Parsing Algorithms
Parsing schemata provide a high level formal de scription of parsers These can be used among others as an intermediate level of abstraction for deriving the formal correctness of a parser A parser is correct if it duely implements a parsing schema that is known to be correct In this paper it is discussed how the correctness of a parsing schema can be proven and how pars ing schemata relate to s...
متن کاملRandom backtracking in backtrack search algorithms for satisfiability
This paper proposes the utilization of randomized backtracking within complete backtrack search algorithms for propositional satisfiability (SAT). In recent years, randomization has become pervasive in SAT algorithms. Incomplete algorithms for SAT, for example the ones based on local search, often resort to randomization. Complete algorithms also resort to randomization. These include state-of-...
متن کاملBacktrack Search Algorithms and the Maximal Common Subgraph Problem
SUMMARY Backtrack algorithms are applicable to a wide variety of problems. An efficient but readable version of such an algorithm is presented and its use in the problem of finding the maximal common subgraph of two graphs is described. Techniques available in this application area for ordering and pruning the backtrack search are discussed. This algorithm has been used successfully as a compon...
متن کاملParsing Algorithms for Grammars with Regulated Rewriting
In recent papers [4, 5, 8, 11] Petri net controlled grammars have been introduced and investigated. It was shown that various regulated grammars such as random context, matrix, vector, valence grammars, etc., resulted from enriching context-free grammars with additional mechanisms can be unified into the Petri net formalism, i.e., a grammar and its control can be represented by a Petri net. Thi...
متن کاملParsing Algorithms and Metrics
Many different metrics exist for evaluating parsing results, including Viterbi, Crossing Brackets Rate, Zero Crossing Brackets Rate, and several others. However, most parsing algorithms, including the Viterbi algorithm, attempt to optimize the same metric, namely the probability of getting the correct labelled tree. By choosing a parsing algorithm appropriate for the evaluation metric, better p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1973
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(73)90851-6